Linear-time recognition of map graphs with outerplanar witness
نویسندگان
چکیده
منابع مشابه
Linear-Time Recognition of Map Graphs with Outerplanar Witness
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed that the problem of recognizing map graphs is in NP by proving the existence of a planar witness graph W . Shortly after, Thorup [FOCS 1998] published a polynomial-time recognition algorithm for map graphs. However, the run time of this algorithm is estimated to be Ω(n1...
متن کاملPlanar Linear Arrangements of Outerplanar Graphs
Given an n -vertex outerplanar graph G I we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i ,j) of G does not exceed a given bandwidth b (i ,n, the total edge length and the cutwidth of the layout is minimized. respectively. We present...
متن کاملA Polynomial-time Metric for Outerplanar Graphs
Graphs are mathematical structures that are capable of representing relational data. In the chemoinformatics context, they have become very popular for the representation of molecules. However, a lot of operations on graphs are NP-complete, so no efficient algorithms that can handle these structures exist. In this paper we focus on outerplanar graphs, a subclass within general graphs. Most mole...
متن کاملLinear time recognition of P4-indifference graphs
A P4 is a chordless path of four vertices. A graph is P4-indifference if it admits an ordering < on its vertex set such that every P4 abcd has a < b < c < d or d < c < b < a. Such an ordering is called a P4-indifference ordering. The P4-indifference graphs were introduced in [Chv84] as a particular class of perfectly orderable graphs. A graph is perfectly orderable if there exists an ordering o...
متن کاملLinear Time Recognition of P4-Indifferent Graphs
A simple graph is P4-indifferent if it admits a total order < on its nodes such that every chordless path with nodes a, b, c, d and edges ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoàng, Maffray and Noy gave a characterization of P4-indifferent graphs in terms of forbidden induced subgraphs. We clari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2018
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.12.002